0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : run_E %s %d THM 0.14/0.34 % Computer : n008.cluster.edu 0.14/0.34 % Model : x86_64 x86_64 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.34 % Memory : 8042.1875MB 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.34 % CPULimit : 960 0.14/0.34 % WCLimit : 120 0.14/0.34 % DateTime : Tue Aug 9 04:18:09 EDT 2022 0.14/0.34 % CPUTime : 0.20/0.47 Running higher-order on 8 cores theorem proving 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.20/0.47 # Version: 3.0pre003-ho 0.20/0.48 # Preprocessing class: HSMSSMSSMLMNHSN. 0.20/0.48 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.48 # Starting ho_unfolding_3 with 600s (5) cores 0.20/0.48 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.20/0.48 # Starting almost_fo_3_lam with 120s (1) cores 0.20/0.48 # Starting post_as_ho1 with 120s (1) cores 0.20/0.48 # ehoh_best2_full_lfho with pid 5421 completed with status 0 0.20/0.48 # Result found by ehoh_best2_full_lfho 0.20/0.48 # Preprocessing class: HSMSSMSSMLMNHSN. 0.20/0.48 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.48 # Starting ho_unfolding_3 with 600s (5) cores 0.20/0.48 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.20/0.48 # No SInE strategy applied 0.20/0.48 # Search class: HHUNF-FFSS00-SHSSMFNN 0.20/0.48 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.20/0.48 # Starting new_ho_10 with 65s (1) cores 0.20/0.48 # new_ho_10 with pid 5427 completed with status 0 0.20/0.48 # Result found by new_ho_10 0.20/0.48 # Preprocessing class: HSMSSMSSMLMNHSN. 0.20/0.48 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.48 # Starting ho_unfolding_3 with 600s (5) cores 0.20/0.48 # Starting ehoh_best2_full_lfho with 120s (1) cores 0.20/0.48 # No SInE strategy applied 0.20/0.48 # Search class: HHUNF-FFSS00-SHSSMFNN 0.20/0.48 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.20/0.48 # Starting new_ho_10 with 65s (1) cores 0.20/0.48 # Preprocessing time : 0.001 s 0.20/0.48 # Presaturation interreduction done 0.20/0.48 0.20/0.48 # Proof found! 0.20/0.48 # SZS status Theorem 0.20/0.48 # SZS output start CNFRefutation 0.20/0.48 thf(decl_22, type, meq_ind: mu > mu > $i > $o). 0.20/0.48 thf(decl_23, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.48 thf(decl_24, type, mnot: ($i > $o) > $i > $o). 0.20/0.48 thf(decl_25, type, mor: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.48 thf(decl_26, type, mand: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.48 thf(decl_27, type, mimplies: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.48 thf(decl_28, type, mimplied: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.48 thf(decl_29, type, mequiv: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.48 thf(decl_30, type, mxor: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.48 thf(decl_31, type, mforall_ind: (mu > $i > $o) > $i > $o). 0.20/0.48 thf(decl_32, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o). 0.20/0.48 thf(decl_33, type, mexists_ind: (mu > $i > $o) > $i > $o). 0.20/0.48 thf(decl_34, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o). 0.20/0.48 thf(decl_35, type, mtrue: $i > $o). 0.20/0.48 thf(decl_36, type, mfalse: $i > $o). 0.20/0.48 thf(decl_37, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o). 0.20/0.48 thf(decl_38, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o). 0.20/0.48 thf(decl_39, type, mreflexive: ($i > $i > $o) > $o). 0.20/0.48 thf(decl_40, type, msymmetric: ($i > $i > $o) > $o). 0.20/0.48 thf(decl_41, type, mserial: ($i > $i > $o) > $o). 0.20/0.48 thf(decl_42, type, mtransitive: ($i > $i > $o) > $o). 0.20/0.48 thf(decl_43, type, meuclidean: ($i > $i > $o) > $o). 0.20/0.48 thf(decl_44, type, mpartially_functional: ($i > $i > $o) > $o). 0.20/0.48 thf(decl_45, type, mfunctional: ($i > $i > $o) > $o). 0.20/0.48 thf(decl_46, type, mweakly_dense: ($i > $i > $o) > $o). 0.20/0.48 thf(decl_47, type, mweakly_connected: ($i > $i > $o) > $o). 0.20/0.48 thf(decl_48, type, mweakly_directed: ($i > $i > $o) > $o). 0.20/0.48 thf(decl_49, type, mvalid: ($i > $o) > $o). 0.20/0.48 thf(decl_50, type, minvalid: ($i > $o) > $o). 0.20/0.48 thf(decl_51, type, msatisfiable: ($i > $o) > $o). 0.20/0.48 thf(decl_52, type, mcountersatisfiable: ($i > $o) > $o). 0.20/0.48 thf(decl_53, type, rel_s5: $i > $i > $o). 0.20/0.48 thf(decl_54, type, mbox_s5: ($i > $o) > $i > $o). 0.20/0.48 thf(decl_55, type, mdia_s5: ($i > $o) > $i > $o). 0.20/0.48 thf(decl_56, type, f: mu > $i > $o). 0.20/0.48 thf(decl_57, type, esk1_0: $i). 0.20/0.48 thf(decl_58, type, esk2_0: $i). 0.20/0.48 thf(decl_59, type, esk3_0: mu). 0.20/0.48 thf(decl_60, type, esk4_0: $i). 0.20/0.48 thf(mand, axiom, ((mand)=(^[X6:$i > $o, X7:$i > $o]:(mnot @ (mor @ (mnot @ X6) @ (mnot @ X7))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mand)). 0.20/0.48 thf(mnot, axiom, ((mnot)=(^[X6:$i > $o, X3:$i]:(~((X6 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mnot)). 0.20/0.48 thf(mor, axiom, ((mor)=(^[X6:$i > $o, X7:$i > $o, X3:$i]:(((X6 @ X3)|(X7 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mor)). 0.20/0.48 thf(mimplies, axiom, ((mimplies)=(^[X6:$i > $o, X7:$i > $o]:(mor @ (mnot @ X6) @ X7))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mimplies)). 0.20/0.48 thf(mexists_ind, axiom, ((mexists_ind)=(^[X11:mu > $i > $o]:(mnot @ (mforall_ind @ (^[X1:mu]:(mnot @ (X11 @ X1))))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mexists_ind)). 0.20/0.48 thf(mforall_ind, axiom, ((mforall_ind)=(^[X8:mu > $i > $o, X3:$i]:(![X1:mu]:((X8 @ X1 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mforall_ind)). 0.20/0.48 thf(mdia_s5, axiom, ((mdia_s5)=(^[X6:$i > $o]:(mnot @ (mbox_s5 @ (mnot @ X6))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^6.ax', mdia_s5)). 0.20/0.48 thf(mbox_s5, axiom, ((mbox_s5)=(^[X6:$i > $o, X3:$i]:(![X14:$i]:((~((rel_s5 @ X3 @ X14))|(X6 @ X14)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^6.ax', mbox_s5)). 0.20/0.48 thf(mtransitive, axiom, ((mtransitive)=(^[X13:$i > $i > $o]:(![X15:$i, X16:$i, X17:$i]:((((X13 @ X15 @ X16)&(X13 @ X16 @ X17))=>(X13 @ X15 @ X17)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mtransitive)). 0.20/0.48 thf(mvalid, axiom, ((mvalid)=(^[X6:$i > $o]:(![X3:$i]:((X6 @ X3))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', mvalid)). 0.20/0.48 thf(a2, axiom, (mtransitive @ rel_s5), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^6.ax', a2)). 0.20/0.48 thf(prove, conjecture, (mvalid @ (mimplies @ (mand @ (mbox_s5 @ (mforall_ind @ (^[X1:mu]:(mimplies @ (f @ X1) @ (mbox_s5 @ (f @ X1)))))) @ (mdia_s5 @ (mexists_ind @ (^[X1:mu]:(f @ X1))))) @ (mbox_s5 @ (mexists_ind @ (^[X1:mu]:(f @ X1)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', prove)). 0.20/0.48 thf(msymmetric, axiom, ((msymmetric)=(^[X13:$i > $i > $o]:(![X15:$i, X16:$i]:(((X13 @ X15 @ X16)=>(X13 @ X16 @ X15)))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax', msymmetric)). 0.20/0.48 thf(a3, axiom, (msymmetric @ rel_s5), file('/export/starexec/sandbox/benchmark/Axioms/LCL013^6.ax', a3)). 0.20/0.48 thf(c_0_14, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(fof_simplification,[status(thm)],[mand])). 0.20/0.48 thf(c_0_15, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])). 0.20/0.48 thf(c_0_16, plain, ((mor)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])). 0.20/0.48 thf(c_0_17, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])). 0.20/0.48 thf(c_0_18, plain, ((mexists_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(~((![X18:mu]:((~((Z0 @ X18 @ Z1))))))))), inference(fof_simplification,[status(thm)],[mexists_ind])). 0.20/0.48 thf(c_0_19, plain, ((mforall_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(![X1:mu]:((Z0 @ X1 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_ind])). 0.20/0.48 thf(c_0_20, plain, ((mdia_s5)=(^[Z0:$i > $o, Z1:$i]:(~((![X21:$i]:((~((rel_s5 @ Z1 @ X21))|(~((Z0 @ X21)))))))))), inference(fof_simplification,[status(thm)],[mdia_s5])). 0.20/0.48 thf(c_0_21, plain, ((mbox_s5)=(^[Z0:$i > $o, Z1:$i]:(![X14:$i]:((~((rel_s5 @ Z1 @ X14))|(Z0 @ X14)))))), inference(fof_simplification,[status(thm)],[mbox_s5])). 0.20/0.48 thf(c_0_22, plain, ((mtransitive)=(^[Z0:$i > $i > $o]:(![X15:$i, X16:$i, X17:$i]:((((Z0 @ X15 @ X16)&(Z0 @ X16 @ X17))=>(Z0 @ X15 @ X17)))))), inference(fof_simplification,[status(thm)],[mtransitive])). 0.20/0.48 thf(c_0_23, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14, c_0_15]), c_0_16])). 0.20/0.48 thf(c_0_24, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_17, c_0_15]), c_0_16])). 0.20/0.48 thf(c_0_25, plain, ((mexists_ind)=(^[Z0:mu > $i > $o, Z1:$i]:(~((![X18:mu]:((~((Z0 @ X18 @ Z1))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_18, c_0_15]), c_0_19])). 0.20/0.48 thf(c_0_26, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])). 0.20/0.48 thf(c_0_27, plain, ((mdia_s5)=(^[Z0:$i > $o, Z1:$i]:(~((![X21:$i]:((~((rel_s5 @ Z1 @ X21))|(~((Z0 @ X21)))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20, c_0_15]), c_0_21])). 0.20/0.48 thf(c_0_28, plain, ![X25:$i, X26:$i, X27:$i]:((((rel_s5 @ X25 @ X26)&(rel_s5 @ X26 @ X27))=>(rel_s5 @ X25 @ X27))), inference(apply_def,[status(thm)],[a2, c_0_22])). 0.20/0.48 thf(c_0_29, negated_conjecture, ~(![X35:$i]:((~(~((~(![X30:$i]:((~(rel_s5 @ X35 @ X30)|![X29:mu]:((~(f @ X29 @ X30)|![X28:$i]:((~(rel_s5 @ X30 @ X28)|(f @ X29 @ X28))))))))|~(~(![X32:$i]:((~(rel_s5 @ X35 @ X32)|~(~(![X31:mu]:(~(f @ X31 @ X32)))))))))))|![X34:$i]:((~(rel_s5 @ X35 @ X34)|~(![X33:mu]:(~(f @ X33 @ X34)))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove])]), c_0_23]), c_0_24]), c_0_19]), c_0_25]), c_0_26]), c_0_21]), c_0_27])])). 0.20/0.48 thf(c_0_30, plain, ((msymmetric)=(^[Z0:$i > $i > $o]:(![X15:$i, X16:$i]:(((Z0 @ X15 @ X16)=>(Z0 @ X16 @ X15)))))), inference(fof_simplification,[status(thm)],[msymmetric])). 0.20/0.48 thf(c_0_31, plain, ![X39:$i, X40:$i, X41:$i]:((~(rel_s5 @ X39 @ X40)|~(rel_s5 @ X40 @ X41)|(rel_s5 @ X39 @ X41))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])). 0.20/0.48 thf(c_0_32, negated_conjecture, ![X43:$i, X44:mu, X45:$i, X49:mu]:((((~(rel_s5 @ esk1_0 @ X43)|(~(f @ X44 @ X43)|(~(rel_s5 @ X43 @ X45)|(f @ X44 @ X45))))&((rel_s5 @ esk1_0 @ esk2_0)&(f @ esk3_0 @ esk2_0)))&((rel_s5 @ esk1_0 @ esk4_0)&~(f @ X49 @ esk4_0)))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])])). 0.20/0.48 thf(c_0_33, plain, ![X22:$i, X23:$i]:(((rel_s5 @ X22 @ X23)=>(rel_s5 @ X23 @ X22))), inference(apply_def,[status(thm)],[a3, c_0_30])). 0.20/0.48 thf(c_0_34, plain, ![X14:$i, X3:$i, X15:$i]:(((rel_s5 @ X3 @ X15)|~((rel_s5 @ X3 @ X14))|~((rel_s5 @ X14 @ X15)))), inference(split_conjunct,[status(thm)],[c_0_31])). 0.20/0.48 thf(c_0_35, negated_conjecture, (rel_s5 @ esk1_0 @ esk4_0), inference(split_conjunct,[status(thm)],[c_0_32])). 0.20/0.48 thf(c_0_36, plain, ![X36:$i, X37:$i]:((~(rel_s5 @ X36 @ X37)|(rel_s5 @ X37 @ X36))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])). 0.20/0.48 thf(c_0_37, negated_conjecture, ![X3:$i, X1:mu, X14:$i]:(((f @ X1 @ X14)|~((rel_s5 @ esk1_0 @ X3))|~((f @ X1 @ X3))|~((rel_s5 @ X3 @ X14)))), inference(split_conjunct,[status(thm)],[c_0_32])). 0.20/0.48 thf(c_0_38, negated_conjecture, ![X3:$i]:(((rel_s5 @ X3 @ esk4_0)|~((rel_s5 @ X3 @ esk1_0)))), inference(spm,[status(thm)],[c_0_34, c_0_35])). 0.20/0.48 thf(c_0_39, negated_conjecture, ![X1:mu]:(~((f @ X1 @ esk4_0))), inference(split_conjunct,[status(thm)],[c_0_32])). 0.20/0.48 thf(c_0_40, plain, ![X3:$i, X14:$i]:(((rel_s5 @ X14 @ X3)|~((rel_s5 @ X3 @ X14)))), inference(split_conjunct,[status(thm)],[c_0_36])). 0.20/0.48 thf(c_0_41, negated_conjecture, ![X1:mu, X3:$i]:((~((rel_s5 @ esk1_0 @ X3))|~((f @ X1 @ X3)))), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_39]), c_0_40])). 0.20/0.48 thf(c_0_42, negated_conjecture, (f @ esk3_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_32])). 0.20/0.48 thf(c_0_43, negated_conjecture, (rel_s5 @ esk1_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_32])). 0.20/0.48 thf(c_0_44, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_42]), c_0_43])]), ['proof']). 0.20/0.48 # SZS output end CNFRefutation 0.20/0.48 # Parsed axioms : 73 0.20/0.48 # Removed by relevancy pruning/SinE : 0 0.20/0.48 # Initial clauses : 44 0.20/0.48 # Removed in clause preprocessing : 36 0.20/0.48 # Initial clauses in saturation : 8 0.20/0.48 # Processed clauses : 23 0.20/0.48 # ...of these trivial : 0 0.20/0.48 # ...subsumed : 1 0.20/0.48 # ...remaining for further processing : 22 0.20/0.48 # Other redundant clauses eliminated : 0 0.20/0.48 # Clauses deleted for lack of memory : 0 0.20/0.48 # Backward-subsumed : 1 0.20/0.48 # Backward-rewritten : 0 0.20/0.48 # Generated clauses : 22 0.20/0.48 # ...of the previous two non-redundant : 16 0.20/0.48 # ...aggressively subsumed : 0 0.20/0.48 # Contextual simplify-reflections : 1 0.20/0.48 # Paramodulations : 22 0.20/0.48 # Factorizations : 0 0.20/0.48 # NegExts : 0 0.20/0.48 # Equation resolutions : 0 0.20/0.48 # Propositional unsat checks : 0 0.20/0.48 # Propositional check models : 0 0.20/0.48 # Propositional check unsatisfiable : 0 0.20/0.48 # Propositional clauses : 0 0.20/0.48 # Propositional clauses after purity: 0 0.20/0.48 # Propositional unsat core size : 0 0.20/0.48 # Propositional preprocessing time : 0.000 0.20/0.48 # Propositional encoding time : 0.000 0.20/0.48 # Propositional solver time : 0.000 0.20/0.48 # Success case prop preproc time : 0.000 0.20/0.48 # Success case prop encoding time : 0.000 0.20/0.48 # Success case prop solver time : 0.000 0.20/0.48 # Current number of processed clauses : 13 0.20/0.48 # Positive orientable unit clauses : 6 0.20/0.48 # Positive unorientable unit clauses: 0 0.20/0.48 # Negative unit clauses : 2 0.20/0.48 # Non-unit-clauses : 5 0.20/0.48 # Current number of unprocessed clauses: 9 0.20/0.48 # ...number of literals in the above : 22 0.20/0.48 # Current number of archived formulas : 0 0.20/0.48 # Current number of archived clauses : 9 0.20/0.48 # Clause-clause subsumption calls (NU) : 19 0.20/0.48 # Rec. Clause-clause subsumption calls : 16 0.20/0.48 # Non-unit clause-clause subsumptions : 2 0.20/0.48 # Unit Clause-clause subsumption calls : 1 0.20/0.48 # Rewrite failures with RHS unbound : 0 0.20/0.48 # BW rewrite match attempts : 4 0.20/0.48 # BW rewrite match successes : 0 0.20/0.48 # Condensation attempts : 23 0.20/0.48 # Condensation successes : 0 0.20/0.48 # Termbank termtop insertions : 3004 0.20/0.48 0.20/0.48 # ------------------------------------------------- 0.20/0.48 # User time : 0.006 s 0.20/0.48 # System time : 0.002 s 0.20/0.48 # Total time : 0.008 s 0.20/0.48 # Maximum resident set size: 1916 pages 0.20/0.48 0.20/0.48 # ------------------------------------------------- 0.20/0.48 # User time : 0.008 s 0.20/0.48 # System time : 0.005 s 0.20/0.48 # Total time : 0.013 s 0.20/0.48 # Maximum resident set size: 1804 pages 0.20/0.48 EOF